منابع مشابه
Easily Testable Graph Properties
A graph on n vertices is -far from a property P if one has to add or delete from it at least n edges to get a graph satisfying P. A graph property P is strongly testable (in the dense model) if for every fixed > 0 it is possible to distinguish, with one-sided error, between graphs satisfying P and ones that are -far from P by inspecting the induced subgraph on a random subset of at most f( ) ve...
متن کاملEasily Testable PLA-based FSMS
-A new hardware scheme for easily testable PLA-based Finite State Machines is proposed. With our scheme, all combinationally irredundant crosspoint faults in the PLA logic implementation are testable. Moreover, test generation is easily accomplished because short systematic initialization sequences exist for each internal state in the machine and unit length distinguishing sequences, which hold...
متن کاملEasily Testable Array Multiplier Design Using Vhdl
Presents the design of variable array multipliers using VHDL. Multipliers of various operand sizes for different target processes can be implemented using the proposed VHDL based approach. The multipliers will be testable with a constant number of test vectors irrespective of the operand word lengths. A fast test pattern generator is also developed for simulation of the multiplier designs and s...
متن کاملEasily testable PLA-based finite state machines
the area and timing penalty associated with LSSD techniques are not acceptable to designers. In this paper, we outline a synthesis procedure, which Logic synthesis and minimization techniques can, in beginning from a State Transition Graph description principle, ensure fully and easily testable combinational of a sequential machine, produces an optimized easily and sequential circuit designs. I...
متن کاملConstrained state assignment of easily testable FSMs
We investigate the relationship between the state assignment of the sequential machine and the observability of a faulty internal state on the primary outputs for faults that result in unidirectional errors. We state sufficient conditions for faulty states to propagate to primary outputs in one clock cycle and use them to derive the constraints that must be imposed on the state assignment of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2015
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548314000765